Assigning Proctors to Exams with Scatter Search
نویسندگان
چکیده
In this paper we present an algorithm to assign proctors to exams. This NPhard problem is related to the generalized assignment problem with multiple objectives. The problem consists of assigning teaching assistants to proctor final exams at a university. We formulate this problem as a multiobjective integer program (IP) with a preference function and a workload-fairness function. We then consider also a weighted objective that combines both functions. We develop a scatter search procedure and compare its outcome with solutions found by solving the IP model with CPLEX 6.5. Our test problems are real instances from a University in Spain.
منابع مشابه
IT in Industry
Proctor assignment refers to assigning proctors to examinations with the objective of having the appropriate number of proctors assigned to examinations, subject to conditions such as minimizing the load of proctoring and preventing any conflicting assignments. This problem is intractable, and hence, heuristics algorithms are needed to find good solutions. In this paper, we propose a new soluti...
متن کاملScatter Search and Graph Heuristics for the Examination Timetabling Problem
Examination timetabling problem is an optimization problem which consists in assigning a set of exams to a set of contiguous time slot, satisfying a set of constraints. The problem falls in the category of the NP-Complete problems and is usually tackled using heuristic methods. In this paper we describe a solution algorithm and its implementation based on the graph heuristics and the evolutiona...
متن کاملProctor Assignment at Carleton University
Carleton University needs proctors during examination sessions to oversee the students as they write their final examinations. The process of assigning proctors to examinations is quite complex because of the sheer number of examinations and various complex constraints on allowable assignments. We developed a computer-based system to replace an existing manual system for assigning proctors, fre...
متن کاملParallel Scatter Search Algorithms for Exam Timetabling
University exam timetabling refers to scheduling exams into predefined days, time periods and rooms, given a set of constraints. Exam timetabling is a computationally intractable optimization problem, which requires heuristic techniques for producing adequate solutions within reasonable execution time. For large numbers of exams and students, sequential algorithms are likely to be time consumin...
متن کاملThe Integrated Supply Chain of After-sales Services Model: A Multi-objective Scatter Search Optimization Approach
Abstract: In recent decades, high profits of extended warranty have caused that third-party firms consider it as a lucrative after-sales service. However, customers division in terms of risk aversion and effect of offering extended warranty on manufacturers’ basic warranty should be investigated through adjusting such services. Since risk-averse customers welcome extended warranty, while the cu...
متن کامل